Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Motivated by questions asked by Erdős, we prove that any set with positive upper density contains, for any , a sumset , where , …, are infinite. Our proof uses ergodic theory and relies on structural results for measure preserving systems. Our techniques are new, even for the previously known case of .more » « less
-
Flapan, Erica (Ed.)Since 2012 the University of North Carolina at Greensboro (UNCG) has held an annual summer school in computational number theory aimed at first- and second-year graduate students. In 2020 we were in charge of running the school, entitled An Introduction to Ergodic Theory via Continued Fractions. Given the ongoing COVID-19 outbreak, we decided, in mid-March 2020, to run the school entirely online. In this article we will describe how we carefully tried to preserve as many desirable features of an intensive summer school experience as we could online. Since surveys indicated that the participants were uniformly pleased with their experiences, we hope that our account will help others who wish to organize similar online events.more » « less
-
In this paper we show that every set A⊂ℕ with positive density contains B+C for some pair B,C of infinite subsets of ℕ, settling a conjecture of Erd\H os. The proof features two different decompositions of an arbitrary bounded sequence into a structured component and a pseudo-random component. Our methods are quite general, allowing us to prove a version of this conjecture for countable amenable groups.more » « less
An official website of the United States government

Full Text Available